THE SECRETARIES CONFERENCE

Matroid Secretaries

We prove that for every proper minor-closed class M of Fp-representable matroids, there exists a O(1)-competitive algorithm for the matroid secretary problem on M. This result relies on the extremely powerful matroid minor structure theory being developed by Geelen, Gerards and Whittle. We also note that for asymptotically almost all matroids, the matroid secretary algorithm that selects a rand...

Partially ordered secretaries

The elements of a finite nonempty partially ordered set are exposed at independent uniform times in [0,1] to a selector who, at any given time, can see the structure of the induced partial order on the exposed elements. The selector’s task is to choose online a maximal element. This generalizes the classical linear order secretary problem, for which it is known that the selector can succeed wit...

The information behaviour of secretaries

Truthful Secretaries with Budgets

We study online auction settings in which agents arrive and depart dynamically in a random (secretary) order, and each agent’s private type consists of the agent’s arrival and departure times, value and budget. We consider multi-unit auctions with additive agents for the allocation of both divisible and indivisible items. For both settings, we devise truthful mechanisms that give a constant app...

Secretaries and Administrative Assistants

rapidly and accurately are important. Good interpersonal skills also are vital, because mail distribution clerks work closely with other postal workers, frequently under the tension and strain of meeting dispatch or transportation deadlines and quotas. Postal Service workers often begin on a part-time, flexible basis and become regular or full time, in order of seniority as vacancies occur. Ful...